Efficient region%2Daware large graph construction towards scalable multi%2Dlabel propagation.

Non%2DMetric Locality%2DSensitive Hashing.

One person labels one million images.

Image segmentation with patch%2Dpair density priors.

iComics automatic conversion of movie into comics.

Towards a universal detector by mining concepts with small semantic gaps.

Unified tag analysis with multi%2Dedge graph.

Learning to photograph.
this paper we present a design framework for the creation of learning activities that draw on interest as their primary source of motivation. of learning activities that draw on, framework is the embodiment of a theory that addresses two challenges to the large-scale implementation of interest-driven learning. addresses two challen  coverage, the di iculty o motivating the wide range o learning objectives valued by our educational system with interest, and stakaI)l  the variation over time and across learners o the motivational strength o  interest in a particular topic or activity. o,RzG:A,MHbbjj,.G:,MHRTjj,. ramework is based on a novel categorization o motivational constructs into interest and context-based motivators. MOTIVATING ACTIVE LEARNING: A DESIGN FRAMEWORK FOR INTERESTDRIVEN LEARNING Common sense and cognitive theory concur: Interest and engagement lead to robust learning. Translating that recognition into clear principles for learning environment design is a complexproblem. How can materials, teachers, peer groups, and activity structures be designed to capitalize on interest as a motivation to learn? This question exposes a critical gap between the literature on the design of constructivist learning environments and the educational psychology literature onmotivation. Recent research on constructivist learning environment design has argued for the motivational importance of authentic, interesting tasks and contexts(e.ex Blumenfeld, 1992; Cognition and Technology Group at Vanderbilt, 1992; Guthrie &amp; Alao, 1997; Schank, Fano, Bell, &amp; Jona,1993/1994). The motivation research literature describes the value of the same kind of motivation in studies and in theoretical work regardinginterest. However, neither literature specifically addresses the challenges of des...
Efficient large%2Dscale image annotation by probabilistic collaborative multi%2Dlabel propagation.

Dynamic captioning video accessibility enhancement for hearing impairment.

Dynamic captioning video accessibility enhancement for hearing impairment.

Image tag refinement towards low%2Drank%2C content%2Dtag prior and error sparsity.
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incomplete, resulting in unsatisfactory performances in tag related applications. In this work, the tag refinement problem is formulated as a decomposition of the user-provided tag matrix D into a low-rank refined matrix A and a sparse error matrix E, namelyD = A + E, targeting the optimality measured by four aspects: 1) low-rank: A is of low-rank owing to the semantic correlations among the tags; 2) content consistency: if two images are visually similar, their tag vectors (i.e., column vectors of A) should also be similar; 3) tag correlation: if two tags co-occur with high frequency in general images, their co-occurrence frequency (described by two row vectors of A) should also be high; and 4) error sparsity: thematrixE is sparse since the tag matrix D is sparse and also humans can provide reasonably accurate tags. All these components finally constitute a constrained yet convex optimization problem, and an efficient convergence provable iterative procedure is proposed for the optimization based on accelerated proximal gradient method. Extensive experiments on two benchmark Flickr datasets, with 25K and 270K images respectively, well demonstrate the effectiveness of the proposed tag refinement approach.
Movie2Comics a feast of multimedia artwork.

Cast2Face character identification in movie with actor%2Dcharacter correspondence.

Learning to rank tags.

Common visual pattern discovery via spatially coherent correspondences.

Spatialized epitome and its applications.

Nonparametric Label%2Dto%2DRegion by search.

Nonparametric Label%2Dto%2DRegion by search.

Weakly%2Dsupervised hashing in kernel space.

Visual classification with multi%2Dtask joint sparse representation.

Factorization towards a classifier.

Sparse representation using nonnegative curds and whey.

Randomized Locality Sensitive Vocabularies for Bag%2Dof%2DFeatures Model.

Multi%2DView Object Detection by Classifier Interpolation.

Automated assembly of shredded pieces from multiple photos.

Robust Graph Mode Seeking by Graph Shift.
In this paper, we study how to robustly compute the modes of a graph, namely the dense subgraphs, which characterize the underlying compact patterns and are thus useful for many applications. We first define the modes based on graph density function, then propose the graph shift algorithm, which starts from each vertex and iteratively shifts towards the nearest mode of the graph along a certain trajectory. Both theoretic analysis and experiments show that graph shift algorithm is very efficient and robust, especially when there exist large amount of noises and outliers. 1.
Epitomized Summarization of Wireless Capsule Endoscopic Videos for Efficient Visualization.

Learning Cooking Techniques from YouTube.

Learning Cooking Techniques from YouTube.

Effective music tagging through advanced statistical modeling.

A co%2Dlearning framework for learning user search intents from rule%2Dgenerated training data.

Robust Low%2DRank Subspace Segmentation with Semidefinite Guarantees

Robust Recovery of Subspace Structures by Low%2DRank Representation

Selective Image Super%2DResolution

Closed%2DForm Solutions to A Category of Nuclear Norm Minimization Problems

Misalignment%2DRobust Face Recognition.

Learning With %24%5Cell1%24%2DGraph for Image Analysis.

Projective Nonnegative Graph Embedding.

Label to region by bi%2Dlayer sparsity priors.

Inferring semantic concepts from community%2Dcontributed images and noisy tags.

Web image mining towards universal age estimator.

Recognizing human group activities with localized causalities.

Multi%2Dlabel sparse coding for automatic image annotation.
In this paper, we present a multi-label sparse coding framework for feature extraction and classification within the context of automatic image annotation. First, each image is encoded into a so-called supervector, derived from the universal Gaussian Mixture Models on orderless image patches. Then, a label sparse coding based subspace learning algorithm is derived to effectively harness multilabel information for dimensionality reduction. Finally, the sparse coding method for multi-label data is proposed to propagate the multi-labels of the training images to the query image with the sparse ℓ 1 reconstruction coefficients. Extensive image annotation experiments on the Corel5k and Corel30k databases both show the superior performance of the proposed multi-label sparse coding framework over the state-of-the-art algorithms. 1.
Contextualizing histogram.

Hierarchical spatio%2Dtemporal context modeling for action recognition.

Contextual decomposition of multi%2Dlabel images.

Multiplicative nonnegative greph embedding.

Large scale natural image classification by sparsity exploration.
We consider in this paper the problem of large scale natural image classification. As the explosion and popularity of images in the Internet, there are increasing attentions to utilize millions of or even billions of these images for helping image related research. Beyond the opportunities brought by unlimited data, a great challenge is how to design more effective classification methods under these large scale scenarios. Most of existing attempts are based on k-nearest-neighbor method. However, in spite of the optimistic performance in some tasks, this strategy still suffers from that, one single fixed global parameter k is not robust for different object classes from different semantic levels. In this paper, we propose an alternative method, called ℓ 1-nearest-neighbor, based on a sparse representation computed by ℓ 1-minimization. We first treat a testing sample as a sparse linear combination of all training samples, and then consider the related samples as the nearest neighbors of the testing sample. Finally, we classify the testing sample based on the majority of these neighbors’ classes. We conduct extensive experiments on a 1.6 million natural image database on different semantic levels defined based on WordNet, which demonstrate that the proposed ℓ1-nearest-neighbor algorithm outperforms k-nearestneighbor in two aspects: 1) the robustness of parameter selection for different semantic levels, and 2) the discriminative capability for large scale image classification task. Index Terms — Image classification, sparsity, ℓ 1-nearestneighbor, k-nearest-neighbor, WordNet.
Directed Markov Stationary Features for visual classification.

Unified Solution to Nonnegative Data Factorization Problems.

Synthesizing Novel Dimension Reduction Algorithms in Matrix Trace Oriented Optimization Framework.

Local%2Ddriven semi%2Dsupervised learning with multi%2Dlabel.

Semi%2DSupervised Classification on Evolutionary Data.
In this paper, we consider semi-supervised classification on evolutionary data, where the distribution of the data and the underlying concept that we aim to learn change over time due to shortterm noises and long-term drifting, making a single aggregated classifier inapplicable for long-term classification. The drift is smooth if we take a localized view over the time dimension, which enables us to impose temporal smoothness assumption for the learning algorithm. We first discuss how to carry out such assumption using temporal regularizers defined in a structural way with respect to the Hilbert space, and then derive the online algorithm that efficiently finds the closed-form solution to the classification functions. Experimental results on real-world evolutionary mailing list data demonstrate that our algorithm outperforms classical semi-supervised learning algorithms in both algorithmic stability and classification accuracy. 1
Probabilistic latent semantic user segmentation for behavioral targeted advertising.

Straightforward Feature Selection for Scalable Latent Semantic Indexing.

Semi%2Dsupervised Learning by Sparse Representation.

Temporal query substitution for ad search.

An online blog reading system by topic clustering and personalized ranking.

Enhancing Bilinear Subspace Learning by Element Rearrangement.

Correspondence Propagation with Weak Priors.

Synchronized Submanifold Embedding for Person%2DIndependent Pose Estimation and Beyond.

Ubiquitously Supervised Subspace Learning.

Mode%2Dkn Factor Analysis for Image Ensembles.

Semi%2DSupervised Bilinear Subspace Learning.

Introduction to the special issue on Video%2Dbased Object and Event Analysis.

Trace Ratio Criterion for Feature Selection.

SIFT%2DBag kernel for video event analysis.
In this work, we present a SIFT-Bag based generative-todiscriminative framework for addressing the problem of video event recognition in unconstrained news videos. In the generative stage, each video clip is encoded as a bag of SIFT feature vectors, the distribution of which is described by a Gaussian Mixture Models (GMM). In the discriminative stage, the SIFT-Bag Kernel is designed for characterizing the property of Kullback-Leibler divergence between the specialized GMMs of any two video clips, and then this kernel is utilized for supervised learning in two ways. On one hand, this kernel is further refined in discriminating power for centroid-based video event classification by using the Within-Class Covariance Normalization approach, which depresses the kernel components with high-variability for video clips of the same event. On the other hand, the SIFT-Bag Kernel is used in a Support Vector Machine for margin-based video event classification. Finally, the outputs from these two classifiers are fused together for final decision. The experiments on the TRECVID 2005 corpus demonstrate that the mean average precision is boosted from the best reported 38.2 % in [36] to 60.4 % based on our new framework.
Near%2Dduplicate keyframe retrieval by nonrigid image matching.

Real%2Dtime human action recognition by luminance field trajectory analysis.

Misalignment%2Drobust face recognition.

Discriminative local binary patterns for human detection in personal album.

Misalignment%2Drobust face recognition.

Near duplicate image identification with patially Aligned Pyramid Matching.

Non%2Dnegative graph embedding.
The contributions of this paper are three-fold. First, we present a general formulation for reaping the benefits from both non-negative data factorization and semi-supervised learning, and the solution naturally possesses the characteristics of sparsity, robustness to partial occlusions, and greater discriminating power via extra unlabeled data. Then, an efficient multiplicative updating procedure is proposed along with its theoretic justification of the algorithmic convergency. Finally, the tensorization of this general formulation for non-negative semi-supervised learning is also briefed for handling tensor data of arbitrary order. Extensive experiments compared with the state-of-the-art algorithms for non-negative data factorization and semi-supervised learning demonstrate the algorithmic properties in sparsity, classification power, and robustness to image occlusions. 1
Pair%2Dactivity classification by bi%2Dtrajectories analysis.

Discriminant simplex analysis.

Regression from patch%2Dkernel.

Flexible X%2DY patches for face recognition.

Discriminant simplex analysis.

Extracting age information from local spatially flexible patches.

Learning the Latent Semantic Space for Ranking in Text Retrieval.

Learning by Propagability.
We show a learning-based method for low-level vision problems. We set-up a Markov network of patches of the image and the underlying scene. A factorization approximation allows us to easily learn the parameters of the Markov network from synthetic examples of image/scene pairs, and to e ciently propagate image information. Monte Carlo simulations justify this approximation. We apply this to the \super-resolution &amp;quot; problem (estimating high frequency details from a low-resolution image), showing good results. For the motion estimation problem, we show resolution of the aperture problem and lling-in arising from application of the same probabilistic machinery.
Convergent 2%2DD Subspace Learning With Null Space Analysis.

Web Query Prediction by Unifying Model.

Categorizing bi%2Dobject video activities using bag of segments and causality features.

Reconstruction and Recognition of Tensor%2DBased Objects With Concurrent Subspaces Analysis.

Convergent 2%2DD Subspace Learning With Null Space Analysis.

Correlation Metric for Generalized Feature Extraction.

Face Recognition Using Spatially Constrained Earth Mover%27s Distance.

Classification and Feature Extraction by Simplexization.

Regression From Uncertain Labels and Its Applications to Soft Biometrics.

Matrix%2DVariate Factor Analysis and Its Applications.
HOD process. Therefore, there is a tradeoff between memory and computing time. HOD provides a direct solution for the learning algorithm. In comparison, tuning the MC algorithm to provide lower error rates by increasing the number of samples will result in less iterations to reach convergence, but that will come at the expense of a higher computation time. In the end, the time needed to attain smaller error values makes the decimation method a better choice.
Matrix%2DVariate Factor Analysis and Its Applications.
HOD process. Therefore, there is a tradeoff between memory and computing time. HOD provides a direct solution for the learning algorithm. In comparison, tuning the MC algorithm to provide lower error rates by increasing the number of samples will result in less iterations to reach convergence, but that will come at the expense of a higher computation time. In the end, the time needed to attain smaller error values makes the decimation method a better choice.
Discriminant Locally Linear Embedding With High%2DOrder Tensor Data.

Gait Components and Their Application to Gender Recognition.

Contextual motion field%2Dbased distance for video analysis.

Learning a Person%2DIndependent Representation for Precise 3D Pose Estimation.

Element Rearrangement for Tensor%2DBased Subspace Learning.

Trace Ratio vs. Ratio Trace for Dimensionality Reduction.

Exploring Feature Descritors for Face Recognition.

Learning Auto%2DStructured Regressor from Uncertain Nonnegative Labels.

Local Word Bag Model for Text Categorization.

Detecting Anomaly in Videos from Trajectory Similarity Analysis.

Ranking with Uncertain Labels.

Transductive regression piloted by inter%2Dmanifold relations.
In this paper, we present a novel semisupervised regression algorithm working on multiclass data that may lie on multiple manifolds. Unlike conventional manifold regression algorithms that do not consider the class distinction of samples, our method introduces the class information to the regression process and tries to exploit the similar configurations shared by the label distribution of multi-class data. To utilize the correlations among data from different classes, we develop a cross-manifold label propagation process and employ labels from different classes to enhance the regression performance. The interclass relations are coded by a set of intermanifold graphs and a regularization item is introduced to impose inter-class smoothness on the possible solutions. In addition, the algorithm is further extended with the kernel trick for predicting labels of the out-ofsample data even without class information. Experiments on both synthesized data and real world problems validate the effectiveness of the proposed framework for semisupervised regression. 1.
A Convengent Solution to Tensor Subspace Learning.

Causal relation of queries from temporal logs.

Ranking with uncertain labels and its applications.

Nonlinear Discriminant Analysis on Embedded Manifold.

Graph Embedding and Extensions A General Framework for Dimensionality Reduction.
Abstract—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different solutions to the problem of dimensionality reduction. Despite the different motivations of these algorithms, we present in this paper a general formulation known as graph embedding to unify them within a common framework. In graph embedding, each algorithm can be considered as the direct graph embedding or its linear/kernel/tensor extension of a specific intrinsic graph that describes certain desired statistical or geometric properties of a data set, with constraints from scale normalization or a penalty graph that characterizes a statistical or geometric property that should be avoided. Furthermore, the graph embedding framework can be used as a general platform for developing new dimensionality reduction algorithms. By utilizing this framework as a tool, we propose a new supervised dimensionality reduction algorithm called Marginal Fisher Analysis in which the intrinsic graph characterizes the intraclass compactness and connects each data point with its neighboring points of the same class, while the penalty graph connects the marginal points and characterizes the interclass separability. We show that MFA effectively overcomes the limitations of the traditional Linear Discriminant Analysis algorithm due to data distribution assumptions and available projection directions. Real face recognition experiments show the superiority of our proposed MFA in comparison to LDA, also for corresponding kernel and tensor extensions. Index Terms—Dimensionality reduction, manifold learning, subspace learning, graph embedding framework. 1
Multilinear Discriminant Analysis for Face Recognition.

Face Verification With Balanced Thresholds.

Formulating Face Verification With Semidefinite Programming.

Marginal Fisher Analysis and Its Variants for Human Gait Recognition and Content%2D Based Image Retrieval.

A Parameter%2DFree Framework for General Supervised Subspace Learning.

Bilinear Analysis for Kernel Selection and Nonlinear Feature Extraction.

Rank%2DOne Projections With Adaptive Margins for Face Recognition.

Face Recognition %2D a Generalized Marginal Fisher Analysis Approach.

Maximum unfolded embedding formulation

Learning Semantic Patterns with Discriminant Localized Binary Projections.
Simple binary patterns have been successfully used for extracting feature representations for visual object classification. In this paper, we present a method to learn a set of discriminative tri-value patterns for projecting high dimensional raw visual inputs into a low dimensional subspace for tasks such as face detection. Unlike previous methods that use predefined simple transform bases to generate tens of thousands features first and then use machine learning to select the most useful features, our method attempts to learn discriminative transform bases directly. Since it would be extremely hard to develop analytical solutions, we define an objective function that can be solved using simulated annealing. To reduce the search space, we impose sparseness and smoothness constraints on the transform bases. Experimental results demonstrate that our method is effective and provides an alternative approach to effective visual object classification. 1.
Rank%2Done Projections with Adaptive Margins for Face Recognition.

Pursuing Informative Projection on Grassmann Manifold.

Trace Quotient Problems Revisited.

A Novel Scalable Algorithm for Supervised Subspace Learning.
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as Principal Component Analysis (PCA) do not make use of the class information, and Linear Discriminant Analysis (LDA) could not be performed efficiently in a scalable way. In this paper, we propose a novel highly scalable supervised subspace learning algorithm called as Supervised Kampong Measure (SKM). It assigns data points as close as possible to their corresponding class mean, simultaneously assigns data points to be as far as possible from the other class means in the transformed lower dimensional subspace. Theoretical derivation shows that our algorithm is not limited by the number of classes or the singularity problem faced by LDA. Furthermore, our algorithm can be executed in an incremental manner in which learning is done in an online fashion as data streams are received. Experimental results on several datasets, including a very large text data set RCV1, show the outstanding performance of our proposed algorithm on classification problems as compared to PCA, LDA and a popular feature selection approach, Information Gain (IG). 1.
Locally adaptive classification piloted by uncertainty.
Locally adaptive classifiers are usually superior to the use of a single global classifier. However, there are two major problems in designing locally adaptive classifiers. First, how to place the local classifiers, and, second, how to combine them together. In this paper, instead of placing the classifiers based on the data distribution only, we propose a responsibility mixture model that uses the uncertainty associated with the classification at each training sample. Using this model, the local classifiers are placed near the decision boundary where they are most effective. A set of local classifiers are then learned to form a global classifier by maximizing an estimate of the probability that the samples will be correctly classified with a nearest neighbor classifier. Experimental results on both artificial and real-world data sets demonstrate its superiority over traditional algorithms. 1.
Dimensionality Reduction with Adaptive Kernels.

Perspective Symmetry Invariant and Its Applications.

Human Gait Recognition With Matrix Representation.
Abstract—Human gait is an important biometric feature. It can be perceived from a great distance and has recently attracted greater attention in video-surveillance-related applications, such as closed-circuit television. We explore gait recognition based on a matrix representation in this paper. First, binary silhouettes over one gait cycle are averaged. As a result, each gait video sequence, containing a number of gait cycles, is represented by a series of gray-level averaged images. Then, a matrix-based unsupervised algorithm, namely coupled subspace analysis (CSA), is employed as a preprocessing step to remove noise and retain the most representative information. Finally, a supervised algorithm, namely discriminant analysis with tensor representation, is applied to further improve classification ability. This matrix-based scheme demonstrates a much better gait recognition performance than state-of-the-art algorithms on the standard USF HumanID Gait database. Index Terms—Coupled subspaces analysis (CSA), dimensionality reduction, discriminant analysis with tensor representation (DATER), human gait recognition, object representation. I.
Effective and Efficient Dimensionality Reduction for Large%2DScale and Streaming Data Preprocessing.
Abstract—Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the effectiveness of classifiers. Traditional dimensionality reduction approaches fall into two categories: Feature Extraction and Feature Selection. Techniques in the feature extraction category are typically more effective than those in feature selection category. However, they may break down when processing large-scale data sets or data streams due to their high computational complexities. Similarly, the solutions provided by the feature selection approaches are mostly solved by greedy strategies and, hence, are not ensured to be optimal according to optimized criteria. In this paper, we give an overview of the popularly used feature extraction and selection algorithms under a unified framework. Moreover, we propose two novel dimensionality reduction algorithms based on the Orthogonal Centroid algorithm (OC). The first is an Incremental OC (IOC) algorithm for feature extraction. The second algorithm is an Orthogonal Centroid Feature Selection (OCFS) method which can provide optimal solutions according to the OC criterion. Both are designed under the same optimization criterion. Experiments on Reuters Corpus Volume-1 data set and some public large-scale text data sets indicate that the two algorithms are favorable in terms of their effectiveness and efficiency when compared with other state-of-the-art algorithms. Index Terms—Feature extraction, feature selection, orthogonal centroid algorithm. 1
A scalable supervised algorithm for dimensionality reduction on streaming data.

Graph Embedding A General Framework for Dimensionality Reduction.
In the last decades, a large family of algorithms ─ supervised or unsupervised; stemming from statistic or geometry theory─have been proposed to provide different solutions to the problem of dimensionality reduction. In this paper, beyond the different motivations of these algorithms, we propose a general framework, graph embedding along with its linearization and kernelization, which in theory reveals the underlying objective shared by most previous algorithms. It presents a unified perspective to understand these algorithms; that is, each algorithm can be considered as the direct graph embedding or its linear/kernel extension of some specific graph characterizing certain statistic or geometry property of a data set. Furthermore, this framework is a general platform to develop new algorithm for dimensionality reduction. To this end, we propose a new supervised algorithm, Marginal Fisher Analysis (MFA), for dimensionality reduction by designing two graphs that characterize the intra-class compactness and interclass separability, respectively. MFA measures the intra-class compactness with the distance between each data point and its neighboring points of the same class, and measures the inter-class separability with the class margins; thus it overcomes the limitations of traditional Linear Discriminant Analysis algorithm in terms of data distribution assumptions and available projection directions. The toy problem on artificial data and the real face recognition experiments both show the superiority of our proposed MFA in comparison to LDA. 1.
Discriminant Analysis with Tensor Representation.
In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a Discriminant Tensor Criterion (DTC), whereby multiple interrelated lower-dimensional discriminative subspaces are derived for feature selection. Then, a novel approach called k-mode Cluster-based Discriminant Analysis is presented to iteratively learn these subspaces by unfolding the tensor along different tensor dimensions. We call this algorithm Discriminant Analysis with Tensor Representation (DATER), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes; 2) for classification problems involving higher-order tensors, the DATER algorithm can avoid the curse of dimensionality dilemma and overcome the small sample size problem; and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in generalized eigenvalue decomposition. We provide extensive experiments by encoding face images as 2nd or 3rd order tensors to demonstrate that the proposed DATER algorithm based on higher order tensors has the potential to outperform the traditional subspace learning algorithms, especially in the small sample size cases. 1.
Coupled Kernel%2DBased Subspace Learning.
It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the Kernel Discriminant Analysis (KDA) algorithm as an example to perform kernel analysis on 2D image matrices directly. First, each image matrix is decomposed as the product of two orthogonal matrices and a diagonal one by using Singular Value Decomposition; then an image matrix is expanded to be of higher or even infinite dimensions by applying the kernel trick on the column vectors of the two orthogonal matrices; finally, two coupled discriminative kernel subspaces are iteratively learned for dimensionality reduction by optimizing the Fisher criterion measured by Frobenius norm. The derived algorithm, called Coupled Kernel Discriminant Analysis (CKDA), effectively utilizes the underlying spatial structure of objects and the discriminating information is encoded in two coupled kernel subspaces respectively. The experiments on real face databases compared with KDA and Fisherface validate the effectiveness of CKDA. 1.
Fisher Kernel Criterion for Discriminant Analysis.

Concurrent Subspaces Analysis.
A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a new algorithm, called Concurrent Subspaces Analysis (CSA), to derive representative subspaces by encoding image objects as 2 nd or even higher order tensors. In CSA, an original higher dimensional tensor is transformed into a lower dimensional one using multiple concurrent subspaces that characterize the most representative information of different dimensions, respectively. Moreover, an efficient procedure is provided to learn these subspaces in an iterative manner. As analyzed in this paper, each sub-step of CSA takes the column vectors of the matrices, which are acquired from the k-mode unfolding of the tensors, as the new objects to be analyzed, thus the curse of dimensionality dilemma can be effectively avoided. The extensive experiments on the 3 rd order tensor data, simulated video sequences and Gabor filtered digital number image database show that CSA outperforms Principal Component Analysis in terms of both reconstruction and classification capability. 1.
Graph Embedding A General Framework for Dimensionality Reduction.
In the last decades, a large family of algorithms ─ supervised or unsupervised; stemming from statistic or geometry theory─have been proposed to provide different solutions to the problem of dimensionality reduction. In this paper, beyond the different motivations of these algorithms, we propose a general framework, graph embedding along with its linearization and kernelization, which in theory reveals the underlying objective shared by most previous algorithms. It presents a unified perspective to understand these algorithms; that is, each algorithm can be considered as the direct graph embedding or its linear/kernel extension of some specific graph characterizing certain statistic or geometry property of a data set. Furthermore, this framework is a general platform to develop new algorithm for dimensionality reduction. To this end, we propose a new supervised algorithm, Marginal Fisher Analysis (MFA), for dimensionality reduction by designing two graphs that characterize the intra-class compactness and interclass separability, respectively. MFA measures the intra-class compactness with the distance between each data point and its neighboring points of the same class, and measures the inter-class separability with the class margins; thus it overcomes the limitations of traditional Linear Discriminant Analysis algorithm in terms of data distribution assumptions and available projection directions. The toy problem on artificial data and the real face recognition experiments both show the superiority of our proposed MFA in comparison to LDA. 1.
Neighborhood Preserving Embedding.
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling a probability distribution that has support on or near a submanifold of Euclidean space. In this paper, we propose a novel subspace learning algorithm called Neighborhood Preserving Embedding (NPE). Different from Principal Component Analysis (PCA) which aims at preserving the global Euclidean structure, NPE aims at preserving the local neighborhood structure on the data manifold. Therefore, NPE is less sensitive to outliers than PCA. Also, comparing to the recently proposed manifold learning algorithms such as Isomap and Locally Linear Embedding, NPE is defined everywhere, rather than only on the training data points. Furthermore, NPE may be conducted in the original space or in the reproducing kernel Hilbert space into which data points are mapped. This gives rise to kernel NPE. Several experiments on face database demonstrate the effectiveness of our algorithm. 1.
Largest%2Deigenvalue%2Dtheory for incremental principal component analysis.

Tensor%2Dbased factor decomposition for relighting.
Abstract — Lighting condition is an important factor in face analysis and synthesis, which has received extensive study in both computer vision and computer graphics. Motivated by the work on multilinear model, we propose a learning-based algorithm for relighting based on tensor framework, which explicitly accounts for the interaction of the identity factor and the lighting factor. The major contribution of our work is that we develop a novel algorithm based on a two-stage decomposition scheme to simultaneously and robustly solve for the identity parameter and the lighting parameter which are both unknown. Equipped with the decomposition algorithm, the capability of the tensor model is significantly extended. Experiment results illustrate the effectiveness of our algorithm. I.
Feedback%2Dbased dynamic generalized LDA for face recognition.

Comparative study face recognition on unspecific persons using linear subspace methods.

Realistic 3D Face Modeling by Fusing Multiple 2D Images.
In this paper, we propose a fully automatic and efficient algorithm for realistic 3D face reconstruction by fusing multiple 2D face images. Firstly, an efficient multiview 2D face alignment algorithm is utilized to localize the facial points of the face images; and then the intrinsic shape and texture models are inferred by the proposed Syncretized Shape Model (SSM) and Syncretized Texture Model (STM), respectively. Compared with other related works, our proposed algorithm has the following characteristics: 1�the inferred shape and texture are more realistic owing to the constraints and co-enhancement among the multiple images; 2) it is fully automatic, without any user interaction; and 3) the shape and pose parameter estimation is efficient via EM approach and unit quaternion based pose representation, and is also robust as a result of the dynamic correspondence approach. The experimental results show the effectiveness of our proposed algorithm for 3D face reconstruction.
Parallel Image Matrix Compression for Face Recognition.
The canonical face recognition algorithm Eigenface and Fisherface are both based on one dimensional vector representation. However, with the high feature dimensions and the small training data, face recognition often suffers from the curse of dimension and the small sample problem. Recent research [4] shows that face recognition based on direct 2D matrix representation, i.e. 2DPCA, obtains better performance than that based on traditional vector representation. However, there are three questions left unresolved in the 2DPCA algorithm: 1) what is the meaning of the eigenvalue and eigenvector of the covariance matrix in 2DPCA; 2) why 2DPCA can outperform Eigenface; and 3) how to reduce the dimension after 2DPCA directly. In this paper, we analyze 2DPCA in a different view and proof that 2DPCA is actually a “localized” PCA with each row vector of an image as object. With this explanation, we discover the intrinsic reason that 2DPCA can outperform Eigenface is because fewer feature dimensions and more samples are used in 2DPCA, when compared with Eigenface. To further reduce the dimension after 2DPCA, a two-stage strategy, namely parallel image matrix compression (PIMC), is proposed to compress the image matrix redundancy, which exists among row vectors and column vectors. The exhaustive experiment results demonstrate that PIMC is superior to 2DPCA and Eigenface, and PIMC+LDA outperforms 2DPCA+LDA and Fisherface. 1.
OCFS optimal orthogonal centroid feature selection for text categorization.
ABSTRACT 1 Text categorization is an important research area in many Information Retrieval (IR) applications. To save the storage space and computation time in text categorization, efficient and effective algorithms for reducing the data before analysis are highly desired. Traditional techniques for this purpose can generally be classified into feature extraction and feature selection. Because of efficiency, the latter is more suitable for text data such as web documents. However, many popular feature selection techniques such as Information Gain (IG) and 2 χ-test (CHI) are all greedy in nature and thus may not be optimal according to some criterion. Moreover, the performance of these greedy methods may be deteriorated when the reserved data dimension is extremely low. In this paper, we propose an efficient optimal feature selection algorithm by optimizing the objective function of Orthogonal Centroid (OC) subspace learning algorithm in a discrete solution space, called Orthogonal Centroid Feature Selection (OCFS). Experiments on 20 Newsgroups (20NG), Reuters Corpus Volume 1 (RCV1) and Open Directory Project (ODP) data show that OCFS is consistently better than IG and CHI with smaller computation time especially when the reduced dimension is extremely small.
Robust Non%2DFrontal Face Alignment with Edge Based Texture.

Face Recognition Using Laplacianfaces.
Abstract—We propose an appearance-based face recognition method called the Laplacianface approach. By using Locality Preserving Projections (LPP), the face images are mapped into a face subspace for analysis. Different from Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) which effectively see only the Euclidean structure of face space, LPP finds an embedding that preserves local information, and obtains a face subspace that best detects the essential face manifold structure. The Laplacianfaces are the optimal linear approximations to the eigenfunctions of the Laplace Beltrami operator on the face manifold. In this way, the unwanted variations resulting from changes in lighting, facial expression, and pose may be eliminated or reduced. Theoretical analysis shows that PCA, LDA, and LPP can be obtained from different graph models. We compare the proposed Laplacianface approach with Eigenface and Fisherface methods on three different face data sets. Experimental results suggest that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition. Index Terms—Face recognition, principal component analysis, linear discriminant analysis, locality preserving projections, face manifold, subspace learning. 1
Learning quantifiable associations via principal sparse non%2Dnegative matrix factorization.
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To
additionally capture the quantitative association knowledge, Korn et.al. recently propose a paradigm named Ratio Rules [6] for
quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA), and as a result,
it cannot guarantee that the ratio coefficients are non-negative. This may lead to serious problems in the rules’ application.
In this paper, we propose a new method, called Principal Sparse Non-negative Matrix Factorization (PSNMF), for learning
the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the
importance of each rule for the entire dataset. Experiments on several datasets illustrate that the proposed method performs
well for discovering latent associations between itemsets in large datasets.
Robust Non%2DFrontal Face Alignment with Edge Based Texture.

Efficient 3D reconstruction for face recognition.
� This work was performed while the authors were visiting Microsoft Research Asia.
Efficient PageRank with Same Out%2DLink Groups.

Learning similarity measures in non%2Dorthogonal space.
Many machine learning and data mining algorithms crucially rely on the similarity metrics. The Cosine similarity, which calculates the inner product of two normalized feature vectors, is one of the most commonly used similarity measures. However, in many practical tasks such as text categorization and document clustering, the Cosine similarity is calculated under the assumption that the input space is an orthogonal space which usually could not be satisfied due to synonymy and polysemy. Various algorithms such as Latent Semantic Indexing (LSI) were used to solve this problem by projecting the original data into an orthogonal space. However LSI also suffered from the high computational cost and data sparseness. These shortcomings led to increases in computation time and storage requirements for large scale realistic data. In this paper, we propose a novel and effective similarity
Discriminant Analysis on Embedded Manifold.

Automatic 3D Reconstruction for Face Recognition.
An analysis-by-synthesis framework for face recognition with variant pose, illumination and expression (PIE) is proposed in this paper. First, an efficient 2D-to-3D integrated face reconstruction approach is introduced to reconstruct a personalized 3D face model from a single frontal face image with neutral expression and normal illumination; Then, realistic virtual faces with different PIE are synthesized based on the personalized 3D face to characterize the face subspace; Finally, face recognition is conducted based on these representative virtual faces. Compared with other related works, this framework has the following advantages: 1) only one single frontal face is required for face recognition, which avoids the burdensome enrollment work; 2) the synthesized face samples provide the capability to conduct recognition under difficult conditions like complex PIE; and 3) the proposed 2D-to-3D integrated face reconstruction approach is fully automatic and more efficient. The extensive experimental results show that the synthesized virtual faces significantly improve the accuracy of face recognition with variant PIE. 1.
Online Supervised Learning for Digital Library.

Mining Ratio Rules Via Principal Sparse Non%2DNegative Matrix Factorization.
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, F.Korn et al recently proposed a paradigm named Ratio Rules [4] for quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA) and as a result, it cannot guarantee that the ratio coefficient is non-negative. This may lead to serious problems in the rules’ application. In this paper, we propose a new method, called Principal Sparse Non-Negative Matrix Factoriza-tion (PSNMF), for learning the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the importance of each rule for the entire dataset. 1.
IMMC incremental maximum margin criterion.
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or large-scale data. To meet this desirability, Incremental Principal Component Analysis (IPCA) algorithm has been well established, but it is an unsupervised subspace learning approach and is not optimal for general classification tasks, such as face recognition and Web document categorization. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Maximum Margin Criterion (IMMC), to infer an adaptive subspace by optimizing the Maximum Margin Criterion. We also present the proof for convergence of the proposed algorithm. Experimental results on both synthetic dataset and real world datasets show that IMMC converges to the similar subspace as that of batch approach.
Automatic
We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexicosyntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested. 1 Introduction  Currently there is much interest in the automatic acquisition of lexical syntax and semantics, with the goal of building up large lexicons for natural language processing. Projects ...
Link fusion a unified link analysis framework for multi%2Dtype interrelated data objects.
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web hyperlinks), which represent the relationship of data objects within a homogeneous data type (web pages), and inter-type links (e.g., user browsing log) which represent the relationship of data objects across different data types (users and web pages). Unfortunately, most link analysis research only considers one type of link. In this paper, we propose a unified link analysis framework, called &#034;link fusion&#034;, which considers both the inter- and intra- type link structure among multiple-type inter-related data objects and brings order to objects in each data type at the same time. The PageRank and HITS algorithms are shown to be special cases of our unified link analysis framework. Experiments on an instantiation of the framework that makes use of the user data and web pages extracted from a proxy log show that our proposed algorithm could improve the search effectiveness over the HITS and DirectHit algorithms by 24.6% and 38.2% respectively.
Bayesian shape localization for face recognition using global and local textures.
The face recognition problem has been faced for more than 30 years. Although a lot of research has been done, much more research is and will be required in order to end up with a robust face recognition system with a potential close to human performance. Currently face recognition systems, FRS, report high performance levels, however achievement of
Learning a Locality Preserving Subspace for Visual Recognition.
Previous works have demonstrated that the face recognition performance can be improved significantly in low dimensional linear subspaces. Conventionally, principal component analysis (PCA) and linear discriminant analysis (LDA) are considered effective in deriving such a face subspace. However, both of them effectively see only the Euclidean structure of face space. In this paper, we propose a new approach to mapping face images into a subspace obtained by Locality Preserving Projections (LPP) for face analysis. We call this Laplacianface approach. Different from PCA and LDA, LPP finds an embedding that preserves local information, and obtains a face space that best detects the essential manifold structure. In this way, the unwanted variations resulting from changes in lighting, facial expression, and pose may be eliminated or reduced. We compare the proposed Laplacianface approach with eigenface and fisherface methods on three test datasets. Experimental results show that the proposed Laplacianface approach provides a better representation and achieves lower error rates in face recognition. 1.
Ranking Prior Likelihood Distributions for Bayesian Shape Localization Framework.
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood of local features associated with the key points of an object, like face, while preserve the prior ranking order between the ground truth position of a key point and its neighbors; in the inferring stage, a simple efficient iterative algorithm is proposed to uncover the MAP shape by locally modeling the likelihood distribution around each key point via our proposed variational Locally Weighted Learning (VLWL) method. Our proposed framework has the following benefits: 1) compared to the classical PCA models, the likelihood presented by the ranking prior likelihood model has more discriminating power as to the optimal position and its neighbors, especially in the problem with ambiguity between the optimal positions and their neighbors; 2) the VLWL method guarantees that the posterior probability of the derived shape increases monotonously; and 3) the above two methods are both based on accurate probability formulation, which spontaneously leads to a robust confidence measure for the discovered shape. Moreover, we present a theoretical analysis for the convergence of the Constrained Rank-Boost. Extensive experiments compared with the Active Shape Models demonstrate the accuracy, robustness, and stability of our proposed framework. 1.
Face alignment using texture%2Dconstrained active shape models.
In this paper, we propose a texture-constrained active shape model (TC-ASM) to localize a face in an image. TC-ASM effectively incorporates not only the shape prior and local appearance around each landmark, but also the global texture constraint over the shape. Therefore, it performs stable to initialization, accurate in shape localization and robust to illumination variation, with low computational cost. Extensive experiments are provided to demonstrate our algorithm.
Multi%2DView Face Alignment Using Direct Appearance Models.

Multi%2DClass SVM Classifier Based on Pairwise Coupling.

